polynomial algorithm造句

• Inimum network problem and its time - based polynomial algorithm
  最小网络问题及其多项式时间算法
• A polynomial algorithm for minimum - cardinality feedback vertex set problem in outerplanar graphs
  一个求外平面图最小反馈点集的多项式时间算法
• That is to say , we can not use any polynomial algorithm to solve this kind of problems
  也就是说，不能用任何已知的多项式算法求解这种问题。
• Four special capacity expansion problem of undirected network were discussed and the responsible strongly polynomial algorithm was get
  讨论了无向网络容量扩充的4种特殊问题，给出了相应的强多项式算法
• Furthermore , the vertex - neighbor - scattering number of trees is discussed in details . the main contents of chapter 4 are the introduction of edge - neighbor - scattering number of graphs , the edge - neighbor - scattering number values of several simple graphs and a polynomial algorithm of the edge - neighbor - scattering number of trees
  第四章主要定义图的边邻域离散数，给出一些基本图的边邻域离散数值，图的边邻域离散数的界，树的边邻域离散数的一个多项式算法。
• Firstly , a 0 - 1 integer programming mathematical model is constructed to describe tail - number - assigning work happened in domestic airline , since the problem is npc , a unified polynomial algorithm which satisfies engineering requirement is unavailable . illuminated by the practical experience , a specific tna problem is classified into one of three typical tna modes : tna based on fleet dispatching commands , tna based on fleet balance application , tna based on minimum fleet requirement ; secondly , by simplifying and relaxing some minor constraints , corresponding mathematical models and heuristic algorithms are reconstructed for each typical tna mode ; finally , computing complexities are discussed
  为此论文在借鉴手工编制排班计划经验的基础上，将一个具体的飞机排班问题，归结为三种典型排班模式中的一种，即：基于飞机调度指令要求的排班问题，基于飞机使用均衡要求的排班问题和基于最少需用飞机数的排班问题，对于每种典型的飞机排班模式，在对次要的约束条件进行简化、松驰的基础上构造出相应的能够满足工程应用要求的启发式算法，并分析了算法的复杂性。
• Abstract : in this paper , we discussed a new kind of single machine scheduling problems with controllable processing times . the objective function being considered was the sum of weighted completion times of all jobs plus the maximum dissatisfaction of all jobs ' processing times that deviated from their specified ones . we presented a polynomial algorithm to solve the problem
  文摘:本文讨论了一类新的加工时间可控的单机排序问题.我们所考虑的目标函数由所有工件的加权完工时间之和与对所有工件的实际加工时间偏离额定加工时间的最大不满意程度这两部分组成.对此问题,我们提出了一个多项式算法